Extension without cut

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extension without cut

In proof theory one distinguishes sequent proofs with cut and cut-free sequent proofs, while for proof complexity one distinguishes Frege-systems and extended Frege-systems. In this paper we show how deep inference can provide a uniform treatment for both classifications, such that we can define cut-free systems with extension, which is neither possible with Frege-systems, nor with the sequent ...

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

Video Cut Detection without Thresholds

Many video cut detection algorithms have been proposed in the literature, but in most approaches several parameters and thresholds have to be set to achieve good detection results. In this paper, we present a new unsupervised learning approach to classify time series of frame disparity values into cuts and non-cuts without any thresholds and parameters. The sliding window size used in this appr...

متن کامل

Matching Objects Without Language Extension

Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems. But existing proposals for pattern matching in such languages rely on language extension, which makes their adoption overly intrusive. We propose an ap...

متن کامل

Extension Theorems without Dedekind Completeness

In the operator version of the Hahn-Banach-Kantorovich theorem, the range space Y is assumed to be Dedekind complete. Y. A. Abramovich and A. W. Wickstead improved this by assuming only the Cantor property on Y . Along the same line of reasoning, we obtained in this paper several new results of this type. We also see that assuming Cantor property on the domain spaces instead gives good results,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2012

ISSN: 0168-0072

DOI: 10.1016/j.apal.2012.07.004